Software ENgineering New bounds for multi-dimensional packing
نویسندگان
چکیده
New upper and lower bounds are presented for a multi-dimensional generalization of bin pa king alled box pa king. Several variants of this problem, in luding bounded spa e box pa king, square pa king, variable sized box pa king and resour e augmented box pa king are also studied. The main results, stated for d = 2, are as follows: A new upper bound of 2.66013 for online box pa king, a new 14=9 + " polynomial time o ine approximation algorithm for square pa king, a new upper bound of 2.43828 for online square pa king, a new lower bound of 1.62176 for online square pa king, a new lower bound of 2.28229 for bounded spa e online square pa king and a new upper bound of 2.32571 for online two-sized box pa king. 2000 Mathemati s Subje t Classi ation: 68W25, 68W4
منابع مشابه
Extending Two-Dimensional Bin Packing Problem: Consideration of Priority for Items
In this paper a two-dimensional non-oriented guillotine bin packing problem is studied when items have different priorities. Our objective is to maximize the total profit which is total revenues minus costs of used bins and wasted area. A genetic algorithm is developed to solve this problem where a new coding scheme is introduced. To evaluate the performance of the proposed GA, first an upper b...
متن کاملA General Framework for Bounds for Higher-Dimensional Orthogonal Packing Problems
Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. In the context of a branch-and-bound framework for solving these packing problems to optimality, it is of crucial importance to have good and easy bounds for an optimal solution. Previous e orts have produced a number of special classes of such bounds. Unfortun...
متن کاملNew Lower Bounds for the Three-dimensional Orthogonal Bin Packing Problem
In this paper, we consider the three-dimensional orthogonal bin packing problem, which is a generalization of the well-known bin packing problem. We present new lower bounds for the problem and demonstrate that they improve the best previous results. The asymptotic worst-case performance ratio of the lower bounds is also proved. In addition, we study the non-oriented model, which allows items t...
متن کاملLower-Dimensional Bounds and a New Model for Higher-Dimensional Orthogonal Packing
Consider the feasibility problem in higher-dimensional orthogonal packing. Given a set I of d-dimensional rectangles, we need to decide whether a feasible packing in a d-dimensional rectangular container is possible. No item rotation is allowed and item edges are parallel to the coordinate axes. Typically, solution methods employ some bounds to facilitate the decision. Various bounds are known,...
متن کاملA Comparative Study of Exact Algorithms for the Two Dimensional Strip Packing Problem
In this paper we consider a two dimensional strip packing problem. The problem consists of packing a set of rectangular items in one strip of width W and infinite height. They must be packed without overlapping, parallel to the edge of the strip and we assume that the items are oriented, i.e. they cannot be rotated. To solve this problem, we use three exact methods: a branch and bound method, a...
متن کامل